On-line scheduling of small open shops
نویسندگان
چکیده
We investigate the problem of on-line scheduling open shops of two and three machines with an objective of minimizing the schedule makespan. We 1rst propose a 1.848-competitive permutation algorithm for the non-preemptive scheduling problem of two machines and show that no permutation algorithm can be better than 1.754-competitive. Secondly, we develop a (27=19)-competitive algorithm for the preemptive scheduling problem of three machines, which is most competitive. ? 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods
In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...
متن کاملModeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملModelling and Scheduling Lot Streaming Flexible Flow Lines
Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...
متن کاملOn-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time
We investigate the problem of on-line scheduling two-machine open shops with the objective of minimizing the makespan. Jobs arrive independently over time, and the existence of a job is not known until its arrival. In the clairvoyant on-line model, the processing requirement of every job becomes fully known at the arrival of the job, while in the non-clairvoyant on-line model, this processing r...
متن کاملThe Unit-Operation-Stock Superstructure (UOSS) and the Quantity-Logic- Quality Paradigm (QLQP) for Production Scheduling in the Process Industries
It is well-known that production scheduling can be largely categorized into open and closed-shops (Graves (1981)). Open-shops are job-shops, flow-shops, machine-shops and project-shops and deal exclusively with the assignment, sequencing and timing decisions (Pinedo (1995)). Closed-shops on the other hand also deal with the same three decision-groups as open-shops but they also must decide on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 110 شماره
صفحات -
تاریخ انتشار 2001